A refined exact algorithm for Edge Dominating Set
نویسندگان
چکیده
منابع مشابه
A Refined Exact Algorithm for Edge Dominating Set
We present an O∗(1.3160n)-time algorithm for the edge dominating set problem in an n-vertex graph, which improves previous exact algorithms for this problem. The algorithm is analyzed by using the “Measure and Conquer method.” We design new branching rules based on conceptually simple local structures, called “clique-producing vertices/cycles,” which significantly simplify the algorithm and its...
متن کاملExact Algorithms for Annotated Edge Dominating Set in Cubic Graphs
Given a graph G = (V,E) together with a nonnegative integer requirement on vertices r : V → Z+, the annotated edge dominating set problem is to find a minimum set M ⊆ E such that, each edge in E −M is adjacent to some edge in M , and M contains at least r(v) edges incident on each vertex v ∈ V . The annotated edge dominating set problem is a natural extension of the classical edge dominating se...
متن کاملAn Exact Algorithm for Connected Red-Blue Dominating Set
In the Connected Red-Blue Dominating Set problem we are given a graph G whose vertex set is partitioned into two parts R and B (red and blue vertices), and we are asked to find a connected subgraph induced by a subset S of B such that each red vertex of G is adjacent to some vertex in S. The problem can be solved in O(2) time by reduction to the Weighted Steiner Tree problem. Combining exhausti...
متن کاملAn Improved Algorithm for Parameterized Edge Dominating Set Problem
An edge dominating set of a graph G = (V,E) is a subset M ⊆ E of edges such that each edge in E \ M is incident to at least one edge in M . In this paper, we consider the parameterized edge dominating set problem which asks us to test whether a given graph has an edge dominating set with size bounded from above by an integer k or not, and we design an O(2.2351)-time and polynomial-space algorit...
متن کاملEdge-Dominating Set Problem
We study the approximability of the weighted edge-dominating set problem. Although even the unweighted case is NP-Complete, in this case a solution of size at most twice the minimum can be efficiently computed due to its close relationship with minimum maximal matching; however, in the weighted case such a nice relationship is not known to exist. In this paper, after showing that weighted edge ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.07.019